A Solution for Time-Dependent Multimodal Shortest Path Problem
نویسندگان
چکیده
منابع مشابه
Approximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملAn evolutionary solution for multimodal shortest path problem in metropolises
This paper addresses the problem of time-dependent shortest multimodal path in complex and large urban areas. This problem is one of the important and practical problems in several fields such as transportation, and recently attracts the research focus due to developments in new application areas. An adapted evolutionary algorithm, in which chromosomes with variable lengths and particularly def...
متن کاملA Landmark Algorithm for the Time-Dependent Shortest Path Problem
The shortest path problem is one of the most classical problem in combinatorial optimization problem which, given an edge-weighted graph and two vertices, asks to find a path between the two vertices of the minimum length. In this thesis, we consider a generalization of the shortest path problem in which the edge length is time-variable, which we call the time-dependent shortest path problem. T...
متن کاملFATES: Finding A Time dEpendent Shortest path
We model a moving object as a sizable physical entity equipped with GPS, wireless communication capability, and a computer. Based on a grid model, we develop a distributed system, FATES, to manage data for moving objects in a two-dimensional space. The system is used to provide time-dependent shortest paths for moving objects. The performance study shows that FATES yields shorter average trip t...
متن کاملDesign and Implementation Issues of a Time-dependent Shortest Path Algorithm for Multimodal Transportation Network
In recent years the structure of transportation networks has become more complex as a result of the fast development of the social and economical infrastructure. When dealing with time dependent multimodal context, transport planning represents a fundamental problem and more specifically for hazardous materials. Several approaches have been proposed that strive to reduce the financial costs, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2009
ISSN: 1812-5654
DOI: 10.3923/jas.2009.3804.3812